Evaluation of Main Memory Join Algorithms for
نویسندگان
چکیده
Current data models like the NF 2 model and object-oriented models support set-valued attributes. Hence, it becomes possible to have join predicates based on set comparison. This paper introduces and evaluates two main memory algorithms to evaluate eeciently this kind of join. More speciically, we concentrate on subset predicates.
منابع مشابه
بهبود به‌روزرسانی پایگاه داده تحلیلی نیمه‌آنی
Near-real time data warehouse gives the end users the essential information to achieve appropriate decisions. Whatever the data are fresher in it, the decision would have a better result either. To achieve a fresh and up-to-date data, the changes happened in the side of source must be added to the data warehouse with little delay. For this reason, they should be transformed in to the data wareh...
متن کاملEvaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates
Current data models like the NF2 model and object-oriented models support setvalued attributes. Hence, it becomes possible to have join predicates based on set comparison. This paper introduces and evaluates several main memory algorithms to evaluate e ciently this kind of join. More speci cally, we concentrate on the set equality and the subset predicates.
متن کاملEvaluation of Main Memory Join Algorithms for Joins with Subset Join Predicates
Current data models like the NF2 model and object,-oriented models support set-valued at.t,ribut,t:s. Hence, it, becomes possible to havt> join prcdica.tes ba.sed on set, comparison. This paper int,roduces and evaluates two main memory algorithms to evaluate efficiently this kind of join. More specifically, we concentrate on subset predicates.
متن کاملPerformance evaluation and comparative study between sort-merge join and hash join
Join is the basic key operation in relational databases which facilitates the combination of two relations based on a common key. It is usually an expensive operation and efficient implementation to improve the performance of many database queries. Join is also a memory intensive operation and consequently is directly affected by the performance of memory subsystem. As compared to the join algo...
متن کاملMassively Parallel NUMA-aware Hash Joins
Driven by the two main hardware trends increasing main memory and massively parallel multi-core processing in the past few years, there has been much research e ort in parallelizing well-known join algorithms. However, the non-uniform memory access (NUMA) of these architectures to main memory has only gained limited attention in the design of these algorithms. We study recent proposals of main ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997